#include <bits/stdc++.h>
#define ll long long
#define all(x) (x).begin(), (x).end()
using namespace std;
bool check(string s){
int q = 0;
if (s.size() == 0)
return true;
for (int i = 0;i < s.size();i++)
if (s[i] == '@')
q++;
if (q == 1){
if (s[0] != '@' and s.back() != '@')
return true;
}
return false;
}
int main()
{
string s;cin>>s;
for (int i = 1;i < s.size(); i++){
if (s[i-1] == '@'){
if (i+1 < s.size() )
s.insert(i+1, ",");
}
}
for (int i = s.size() -1 ;i >= 0; i--){
if(s[i]=='@')
break;
if (s[i] == ',')
s.erase(i, 1);
}
string temp = "";
bool ok = true;
for (int i = 0;i < s.size(); i++){
if (s[i] == ','){
if (!check(temp)){
ok = false;
break;
}
temp = "";
}else{
temp += s[i];
}
}
if (!check(temp))
ok = false;
if (ok)
cout<<s;
else
cout<<"No solution";
return 0;
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |